Random constructions and density results
نویسندگان
چکیده
In this paper we outline a construction method which has been used for minimal blocking sets in PG(2, q) and maximal partial line spreads in PG(n, q) and which must have a lot of more applications. We also give a survey on what is known about the spectrum of sizes of maximal partial line spreads in PG(n, q). At the end we list some more elaborate random techniques used in finite geometry.
منابع مشابه
Evaluating the influence of rules and regulations of urban constructions on height plan implementation (Revision of comprehensive plan for Isfahan-district 4)
The fast growth of urbanism in Iran throughout the last half-century resulted in upholding the expansion of cities as well as the promotion of constructions thereof. Of significant problems and challenges Iran’s cities and metropolises ,in particular, are exposed to, is the failure of urban development plans in control of city height and density. A matter which has led to 100% expansion of the ...
متن کاملOn the Dimension of Deterministic and Random Cantor-like Sets, Symbolic Dynamics, and the Eckmann-ruelle Conjecture
In this paper we unify and extend many of the known results on the dimensions of deterministic and random Cantor-like sets in R n using their symbolic representation. We also construct several new examples of such constructions that illustrate some new phenomena. These sets are deened by geometric constructions with arbitrary placement of subsets. We consider Markov constructions, general symbo...
متن کاملComparison of constructions of irregular Gallager codes
The low density parity check codes whose performance is closest to the Shan-non limit arèGallager codes' based on irregular graphs. We compare alternative methods for constructing these graphs and present two results. First, we nd a `super{Poisson' construction which gives a small improvement in empirical performance over a random construction. Second, whereas Gallager codes normally take N 2 t...
متن کاملRandom Ensembles of Lattices from Generalized Reductions
We propose a general framework to study constructions of Euclidean lattices from linear codes over finite fields. In particular, we prove general conditions for an ensemble constructed using linear codes to contain dense lattices (i.e., with packing density comparable to the Minkowski-Hlawka lower bound). Specializing to number field lattices, we obtain a number of interesting corollaries for i...
متن کاملProperties and simulation of α-permanental random fields
An α-permanental random field is briefly speaking a model for a collection of random variables with positive associations, where α is a positive number and the probability generating function is given in terms of a covariance or more general function so that density and moment expressions are given by certain α-permanents. Though such models possess many appealing probabilistic properties, many...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Des. Codes Cryptography
دوره 47 شماره
صفحات -
تاریخ انتشار 2008